Complexity equals anything II
نویسندگان
چکیده
A bstract We expand on our results in [1] to present a broad new class of gravitational observables asymptotically Anti-de Sitter space living general codimension-zero regions the bulk spacetime. By taking distinct limits, these can reduce well-studied holographic complexity proposals, e.g., volume maximal slice and action or spacetime Wheeler-DeWitt patch. As with codimension-one family found [1], display two key universal features for thermofield double state: they grow linearly time at late times reproduce switchback effect. Hence we argue that any member this is an equally viable candidate as dual complexity. Moreover, using Peierls construction, show variations are encoded symplectic form semi-classical phase-space, which then be mapped CFT.
منابع مشابه
Complexity equals change
Traditionally, models of complexity used in psychology have been based on probabilistic and algorithmic paradigms. While these models have inspired a great deal of research, they are generally opaque about the relationship between complexity and the cost of information processing. We argue that the psychological complexity is easily defined and quantified in terms of change and support this arg...
متن کاملConstructive dimension equals Kolmogorov complexity
We derive the coincidence of Lutz’s constructive dimension and Kolmogorov complexity for sets of infinite strings from Levin’s early result on the existence of an optimal left computable cylindrical semi-measure M via simple calculations.
متن کاملContradiction: When Avoidance Equals Removal - Part II
This paper is the continuation of 1] in this volume. There we present a sceptical semantics which avoids contradiction for extended logic programs plus integrity contraints in the form of denials, based on the notion of optative hypotheses {an abductive approach. In this part we deene a program revision method for removing contradiction from contradictory programs under WFSX, based on the notio...
متن کاملFormalizations Of Substitution Of Equals For Equals
Inference rule substitution of equals for equals has been formalized in terms of simple substitution which performs a replacement even though a free occurrence of a variable is captured contextual substitution which prevents such capture and func tion application We show that in connection with pure rst order predicate calculus the function application and no capture versions of the inference r...
متن کاملAverage Case Complexity Under the Universal Distribution Equals Worst-Case Complexity
The average complexity of any algorithm whatsoever (provided it always terminates) under the universal distribution is of the same order of magnitude as the worst-case complexity. This holds both for time complexity and for space complexity. To focus our discussion, we use as illustrations the particular case of sorting algorithms, and the general case of the average case complexity of NP-compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2023
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep01(2023)154